Consensus formation in multi-state majority and plurality models

نویسنده

  • P Chen
چکیده

Abstract We study consensus formation in interacting systems that evolve by multi-state majority rule and by plurality rule. In an update event, a group of G agents (with G odd), each endowed with an s-state spin variable, is specified. For majority rule, all group members adopt the local majority state; for plurality rule the group adopts the local plurality state. This update is repeated until a final consensus state is generally reached. In the mean field limit, the consensus time for an N-spin system increases as lnN for both majority and plurality rules, with an amplitude that depends on s and G. For finite spatial dimensions, domains undergo diffusive coarsening in majority rule when s or G is small. For larger s and G, opinions spread ballistically from the few groups with an initial local majority. For plurality rule, there is always diffusive domain coarsening towards consensus.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Population Protocols for Exact Majority and Plurality

In this paper we study space-efficient deterministic population protocols for several variants of the majority problem including plurality consensus. We focus on space efficient majority protocols in populations with an arbitrary number of colours C represented by k-bit labels, where k = dlogCe. In particular, we present asymptotically space-optimal (with respect to the adopted k-bit representa...

متن کامل

Optimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics

In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...

متن کامل

What can be computed in a simple chaotic way? (Invited talk)

We provide a brief overview of a set of analytical results regarding some very simple randomized protocols, called dynamics, for solving the plurality consensus problem, together with some examples on how to build efficient and robust distributed algorithms for other fundamental tasks using these protocols as a core subroutine. More specifically, we look at the 3-Majority and the Undecided-Stat...

متن کامل

Mathematical Models for Microbial Kinetics in Solid-State Fermentation: A Review

  Context:In this review, we discuss empirical and stoichiometric models, which have been developed recently in SSF processes and the influence of environmental conditions on the variables of these models. Additionally, new studies on modeling of product formation are also mentioned. <span style="color: windowtext...

متن کامل

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing

We consider plurality consensus in networks of n nodes. Initially, each node has one of k opinions. The nodes execute a (randomized) distributed protocol to agree on the plurality opinion (the opinion initially supported by the most nodes). In certain types of networks the nodes can be quite cheap and simple, and hence one seeks protocols that are not only time efficient but also simple and spa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005